Efficient Nearest Neighbors via Robust Sparse Hashing
نویسندگان
چکیده
منابع مشابه
Locality-Sensitive Hashing for Finding Nearest Neighbors
1053-5888/08/$20.00©2008IEEE IEEE SIGNAL PROCESSING MAGAZINE [128] MARCH 2008 T he Internet has brought us a wealth of data, all now available at our fingertips. We can easily carry in our pockets thousands of songs, hundreds of thousands of images, and hundreds of hours of video. But even with the rapid growth of computer performance, we don’t have the processing power to search this amount of...
متن کاملNearest Neighbors Using Compact Sparse Codes
In this paper, we propose a novel scheme for approximate nearest neighbor (ANN) retrieval based on dictionary learning and sparse coding. Our key innovation is to build compact codes, dubbed SpANN codes, using the active set of sparse coded data. These codes are then used to index an inverted file table for fast retrieval. The active sets are often found to be sensitive to small differences amo...
متن کاملFinding Data Broadness Via Generalized Nearest Neighbors
A data object is broad if it is one of the k-Nearest Neighbors (k-NN) of many data objects. We introduce a new database primitive called Generalized Nearest Neighbor (GNN) to express data broadness. We also develop three strategies to answer GNN queries efficiently for large datasets of multidimensional objects. The R*-Tree based search algorithm generates candidate pages and ranks them based o...
متن کاملEfficient Variation Decomposition via Robust Sparse Regression
In this work, we propose a new technique to accurately decompose process variation into lot‐ to‐lot, wafer‐to‐wafer, wafer‐level spatially correlated, wafer‐level random, within‐die spatially correlated and within‐die random variation components. Performing such variation decomposition narrows down the main variation sources in the manufacturing process, and offers valuable information for proc...
متن کاملBest-Buddies Similarity - Robust Template Matching using Mutual Nearest Neighbors
We propose a novel method for template matching in unconstrained environments. Its essence is the Best-Buddies Similarity (BBS), a useful, robust, and parameter-free similarity measure between two sets of points. BBS is based on counting the number of Best-Buddies Pairs (BBPs)-pairs of points in source and target sets, where each point is the nearest neighbor of the other. BBS has several key f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Image Processing
سال: 2014
ISSN: 1057-7149,1941-0042
DOI: 10.1109/tip.2014.2324280